Some new constant weight codes (Corresp.)

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some new distance-4 constant weight codes

Improved binary constant weight codes with minimum distance 4 and length at most 28 are constructed. A table with bounds on the chromatic number of small Johnson graphs is given.

متن کامل

Weight distributions of some classes of binary cyclic codes (Corresp.)

Let h l (x)h2 (x) be the parity check polynomial of a binary cyclic code. This article presents a formula for decomposing words in the code as sums of multiples of words in the codes whose parity check polynomials are hl(x) and h 2 (x). This decomposition provides information about the weight distribution of the code. This work was supported by National Science Foundation Grants GK-37449 and GK...

متن کامل

New Optimal Constant Weight Codes

In 2006, Smith et al. published a new table of constant weight codes, updating existing tables originally created by Brouwer et al. This paper improves upon these results by filling in 9 missing constant weight codes, all of which are optimal by the second Johnson bound. This completes the tables for A(n, 16, 9) and A(n, 18, 10) up to n = 63 and corrects some A(n, 14, 8).

متن کامل

A new table of constant weight codes

A table of binary constant weight codes of length n <; 28 is presented. Explicit constructions are given for most of the 600 codes in the table; the majority of these codes are new. The known techniques for constructing constant weight codes are surveyed, and also a table is given of (unrestricted) binary codes of length J1 <; 28.

متن کامل

New lower bounds for constant weight codes

with M (which is expected). However, as M increases beyond Ahstrart -Some new lower bounds are given for A(n,4, IV), the maximum number of codewords in a binary code of length n, min imum distance 4, and constant weight IV. In a number of cases the results significantly 1.0 improve on the best bounds previously known. h=O 1 .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 1980

ISSN: 0018-9448

DOI: 10.1109/tit.1980.1056190